Step of Proof: adjacent-append
11,40
postcript
pdf
Inference at
*
1
1
2
1
1
I
of proof for Lemma
adjacent-append
:
1.
T
: Type
2.
x
:
T
3.
y
:
T
4.
L1
:
T
List
5.
L2
:
T
List
6.
i
: {0..(||
L1
@
L2
|| - 1)
}
7.
x
=
L1
[
i
]
8.
y
=
L2
[((
i
+1) - ||
L1
||)]
9.
i
< ||
L1
||
10.
(
i
< (||
L1
|| - 1))
(0 < ||
L1
||) & (0 < ||
L2
||) &
x
= last(
L1
) &
y
= hd(
L2
)
latex
by Auto'
latex
1
:
1:
x
= last(
L1
)
2
:
2:
y
= hd(
L2
)
.
Definitions
P
&
Q
,
x
:
A
B
(
x
)
,
as
@
bs
,
A
B
,
x
:
A
.
B
(
x
)
,
x
:
A
B
(
x
)
,
last(
L
)
,
n
-
m
,
n
+
m
,
#$n
,
hd(
l
)
,
l
[
i
]
,
A
,
a
<
b
,
{
i
..
j
}
,
{
x
:
A
|
B
(
x
)}
,
,
type
List
,
Type
,
s
=
t
,
||
as
||
,
i
j
Lemmas
append
wf
,
non
neg
length
,
length
append
origin